Multicommodity flow problems with a bounded number of paths: A flow deviation approach
نویسندگان
چکیده
منابع مشابه
Multicommodity flow problems with a bounded number of paths: A flow deviation approach
We propose a modified version of the Flow Deviation method of Fratta, Gerla and Kleinrock to solve multicommodity problems with minimal congestion and a bounded number of active paths. We discuss the approximation of the min-max objective function by a separable convex potential function and give a mixed-integer non linear model for the constrained routing problem. A heuristic control of the pa...
متن کاملDewey a Scaling Algorithm for Multicommodity Flow Problems a Scaling Algorithm for Multicommodity Flow Problems
We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a fmite number of scaling phases. In the 8-scaling phase the algorithm determines an eoptimal solution, that is, one in which complementary slackness conditions are satisfied to within 8. We analyze the performance of the algorithm from both the theoretical and practical perspectives.
متن کاملMulticommodity Network Flow Problems
In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...
متن کاملA Scaling Algorithm for Multicommodity Flow Problems
Due to the condition of the original material, there are unavoidable flaws in this reproduction. We have made every effort to provide you with the best copy available. If you are dissatisfied with this product and find it unusable, please contact Document Services as soon as possible.
متن کاملMulticommodity Flow Problems with Commodity Compatibility Relations
We present a class of Multicommodity Flow Problems with Commodity Compatibility Relations (MCFP-CCR), in which compatibility relations among commodities used at each node are required. This class of problems has application in the Train Unit Scheduling Problem (TUSP) [1, 2], where train units of different traction types may not be coupled with each other to serve the same train trip. Computatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2006
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20143